Parallel Peeling Algorithms

Parallel Peeling of Curvilinear Grids

In this paper we present a novel hybrid CPU-GPU approach for rendering curvilinear grids. Visibility sorting is accomplished by parallel peeling cells off the grid, utilizing an active cell peeling front. In each step, we compute the ray-cell intersection coordinates on the GPU, perform accurate volume integration (CPU), and determine the set of active cells for the next iteration (GPU). The ap...

Technical note: determining peeling order using sparse matrix algorithms.

To study the effect of individual genes by segregation or linkage analyses, the likelihood of the model needs to be evaluated. The likelihood can be computed efficiently using the Elston-Stewart algorithm. This algorithm involves summing over the unobserved genotypes in the pedigree, which is called peeling. An important aspect of this algorithm is to determine the order of peeling to maximize ...

Peeling the Cactus: Subexponential-Time Algorithms for Counting Triangulations∗

Given a set of n points S in the plane, a triangulation T of S is a maximal set of non-crossing segments with endpoints in S. We present an algorithm that computes the number of triangulations on a given set of n points in time n √ , significantly improving the previous best running time of O(2n) by Alvarez and Seidel [SoCG 2013]. Our main tool is identifying separators of size O( √ n) of a tri...

Practical Parallel External Memory Algorithms via Simulation of Parallel Algorithms

This thesis introduces PEMS2, an improvement to PEMS (Parallel External Memory System). PEMS executes Bulk-Synchronous Parallel (BSP) algorithms in an External Memory (EM) context, enabling computation with very large data sets which exceed the size of main memory. Many parallel algorithms have been designed and implemented for Bulk-Synchronous Parallel models of computation. Such algorithms ge...

Parallel and bit - parallel text algorithms